Strong AI and the problem of “second-order” algorithms
نویسندگان
چکیده
منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولComplexity and Algorithms for the Traveling Salesman Problem and the Assignment Problem of Second Order
We introduce two new combinatorial optimization problems, which are generalizations of the Traveling Salesman Problem (TSP) and the Assignment Problem (AP) and which we call Traveling Salesman Problem of Second Order (TSP2) and Assignment Problem of Second Order (AP2). TSP2 is motivated by an important application in bioinformatics, especially the Permuted Variable Length Markov model. While TS...
متن کاملefl students gender and socioeconomic status: the use of politeness strategies in the first and second languages
within the components of communicative competence, a special emphasis is put on the “rules of politeness,” specifically the politeness strategies (brown and levinson, 1978) that speakers deploy when performing the request speech act. this is because the degree of imposition that making a request places upon one’s interlocutor(s) has been seen to be influenced by several factors among which, as ...
Strong logics of first and second order
In this paper we investigate strong logics of first and second order that have certain absoluteness properties. We begin with an investigation of first order logic and the strong logics ω-logic and β-logic, isolating two facets of absoluteness, namely, generic invariance and faithfulness. It turns out that absoluteness is relative in the sense that stronger background assumptions secure greater...
متن کاملTeaching Problem-Solving in Algorithms and AI
This paper suggests some teaching strategies for Algorithms and AI courses. These courses can have a common goal of teaching complex problem-solving techniques. Based on my experience teaching undergraduates in a small liberal-arts college, the paper offers concrete ideas for working toward this goal. These ideas are supported by relevant studies in cognitive science and education. Together, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavioral and Brain Sciences
سال: 1990
ISSN: 0140-525X,1469-1825
DOI: 10.1017/s0140525x0008078x